Adaptively Scaling the Metropolis Algorithm Using Expected Squared Jumped Distance
نویسندگان
چکیده
منابع مشابه
On the Optimal Scaling of the Modified Metropolis-Hastings algorithm
Estimation of small failure probabilities is one of the most important and challenging problems in reliability engineering. In cases of practical interest, the failure probability is given by a high-dimensional integral. Since multivariate integration suffers from the curse of dimensionality, the usual numerical methods are inapplicable. Over the past decade, the civil engineering research comm...
متن کاملDynamic Meshing Using Adaptively Sampled Distance Fields
Many models used in real-time graphics applications are generated automatically using techniques such as laser-range scanning. The resultant meshes typically contain one or more orders of magnitude more polygons than can be displayed by today’s graphics hardware. Numerous methods have been proposed for automatically creating level-of-detail (LOD) meshes from large input meshes. These techniques...
متن کاملThe expected value under the Yule model of the squared path-difference distance
The path-difference metric is one of the oldest and most popular distances for the comparison of phylogenetictrees, but its statistical properties are still quite unknown. In this paper we compute the expected valueunder the Yule model of evolution of its square on the space of fully resolved rooted phylogenetic trees withn leaves. This complements previous work by Steel–Penny a...
متن کاملMINRMS: an efficient algorithm for determining protein structure similarity using root-mean-squared-distance
MOTIVATION Existing algorithms for automated protein structure alignment generate contradictory results and are difficult to interpret. An algorithm which can provide a context for interpreting the alignment and uses a simple method to characterize protein structure similarity is needed. RESULTS We describe a heuristic for limiting the search space for structure alignment comparisons between ...
متن کاملA Novel Document Clustering Algorithm Using Squared Distance Optimization Through Genetic Algorithms
K-Means Algorithm is most widely used algorithms in document clustering. However, it still suffer some shortcomings like random initialization, solution converges to local minima, and empty cluster formation. Genetic algorithm is often used for document clustering because of its global search and optimization ability over heuristic problems. In this paper, search ability of genetic algorithm ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2007
ISSN: 1556-5068
DOI: 10.2139/ssrn.1010403